Provable Correctness of Prototype Interpreters in LDL
نویسندگان
چکیده
LDL is a system supporting the design of procedural programming languages and generating prototype interpreters directly from the language definition. A language definition is based on GSFs a kind of attribute grammars and the denotational semantics approach. It is shown how denotational semantics can be transformed into Prolog. It is also shown how the correctness of the prototype interpreters can be proved using a technique developed by Clark and extended by Deransart.
منابع مشابه
Jitk: A Trustworthy In-Kernel Interpreter Infrastructure
Modern operating systems run multiple interpreters in the kernel, which enable user-space applications to add new functionality or specialize system policies. The correctness of such interpreters is critical to the overall system security: bugs in interpreters could allow adversaries to compromise user-space applications and even the kernel. Jitk is a new infrastructure for building in-kernel i...
متن کاملSimple and Efficient Shuffling with Provable Correctness and ZK Privacy
A simple and efficient shuffling scheme containing two protocols is proposed. Firstly, a prototype, Protocol-1 is designed, which is based on the assumption that the shuffling party cannot find a linear relation of the shuffled messages in polynomial time. As application of Protocol-1 is limited, it is then optimised to Protocol-2, which does not need the assumption. Both protocols are simpler ...
متن کاملUniversit a Di Pisa Veriication of Meta-interpreters Veriication of Meta-interpreters
A novel approach to the veriication of meta-interpreters is introduced. We apply a general purpose veriication method for logic programs, proposed in 28], to the case study of the Vanilla and other logic meta-interpreters. We extend the standard notion of declarative correctness, and design a criterion for proving correctness of meta-interpreters in a general sense, including amalgamated and re...
متن کاملVerification of Meta-Interpreters
A novel approach to the veriication of meta-interpreters is introduced. We apply a general purpose veriication method for logic programs, proposed in 28], to the case study of the Vanilla and other logic meta-interpreters. We extend the standard notion of declarative correctness, and design a criterion for proving correctness of meta-interpreters in a general sense, including amalgamated and re...
متن کاملVerification Tools in the Development of Provably Correct Compilers
The paper presents a practical veriication tool that helps in the development of provably correct compilers. The tool is based on the approach of proving termination of PROLOG-like programs using term-rewriting techniques and a technique of testing whether a given PROLOG program can be soundly executed on PROLOG interpreters without the Occur-check test. The tool has been built on top of the th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994